MeshGit: Diffing and Merging Polygonal Meshes

نویسندگان

  • Jonathan D. Denning
  • Fabio Pellacini
چکیده

This paper presents MeshGit, a practical algorithm for diffing and merging polygonal meshes. Inspired by version control for text editing, we introduce the mesh edit distance as a measure of the dissimilarity between meshes. This distance is defined as the minimum cost of matching the vertices and faces of one mesh to those of another. We propose an iterative greedy algorithm to approximate the mesh edit distance, which scales well with model complexity, providing a practical solution to our problem. We translate the mesh correspondence into a set of mesh editing operations that transforms the first mesh into the second. The editing operations can be displayed directly to provide a meaningful visual difference between meshes. For merging, we compute the difference between two versions and their common ancestor, as sets of editing operations. We robustly detect conflicting operations, automatically apply non-conflicting edits, and allow the user to choose how to merge the conflicting edits. We evaluate MeshGit by diffing and merging a variety of meshes and find it to work well for all.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A freeform shape optimization of complex structures represented by arbitrary polygonal or polyhedral meshes

In this paper we propose a new scheme for freeform shape optimization on arbitrary polygonal or polyhedral meshes. The approach consists of three main steps: (1) surface partitioning of polygonal meshes into different patches; (2) a new freeform perturbation scheme of using the Cox–de Boor basis function over arbitrary polygonal meshes, which supports multi-resolution shape optimization and doe...

متن کامل

Solving elliptic eigenvalue problems on polygonal meshes using discontinuous Galerkin composite finite element methods

In this paper we introduce a discontinuous Galerkin method on polygonal meshes. This method arises from the Discontinuous Galerkin Composite Finite Element Method (DGFEM) for source problems on domains with micro-structures. In the context of the present paper, the flexibility of DGFEM is applied to handle polygonal meshes. We prove the a priori convergence of the method for both eigenvalues an...

متن کامل

A new scheme for e cient and direct shape optimization of complex structures represented by polygonal meshes

In this paper, a new shape optimization approach is proposed to provide an e cient optimization solution of complex structures represented by polygonal meshes. Our approach consists of three main steps: (1) surface partitioning of polygonal meshes; (2) generation of shape design variables on the basis of partitioned surface patches; and (3) gradient-based shape optimization of the structures by...

متن کامل

The mimetic finite difference method on polygonal meshes for diffusion-type problems

New mimetic discretizations of diffusion-type equations (for instance, equations modeling single phase Darcy flow in porous media) on unstructured polygonal meshes are derived. The first order convergence rate for the fluid velocity and the second-order convergence rate for the pressure on polygonal, locally refined and non-matching meshes are demonstrated with numerical experiments.

متن کامل

Polygonal Mesh Simplification with Face Color and Boundary Edge Preservation Using Quadric Error Metric

In the applications such as scientific and medical visualization, highly detailed polygonal meshes are needed. Rendering these polygonal meshes usually exceeds the capabilities of graphics hardware. To improve rendering efficiency and maintain proper interactivity, the polygonal mesh simplification technique is commonly used to reduce the number of polygons of the mesh and to construct the mult...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012